1 link tagged with all of: inference + arc agi 2 + ab mcts + treequest
Click any tag below to further narrow down your results
Links
AB-MCTS applies an adaptive branching Monte Carlo tree search at inference time to let top LLMs (o4-mini, Gemini 2.5 Pro, R1-0528) collaborate on hard problems. On the ARC-AGI-2 benchmark, this multi-model approach solves cases no single model can and outperforms each model alone. The team open-sourced their algorithm and benchmark code.
- Combining Gemini 2.5 Pro, o4-mini, and DeepSeek-R1-0528 via AB-MCTS on ARC-AGI-2 outperforms any single model, and solves problems none of them can solve alone.
- A wrong step from one model (e.g., o4-mini) often becomes the hint another model (Gemini or R1-0528) uses to reach the correct answer.
- The method is training-free, adapting Monte Carlo Tree Search to let models propose, vote, and guide exploration, so new models can be swapped in as they emerge.
- Sakana open-sourced the approach as TreeQuest on GitHub alongside a published paper (arxiv.org/abs/2503.04412).